Generalized multicast congestion control
نویسندگان
چکیده
Efficient multicast congestion control (MCC) is one of the critical components required to enable the IP multicast deployment over the Internet. Previously proposed MCC schemes can be categorized in two: single-rate or multi-rate. Single-rate schemes make all recipients get data at a common rate allowed by the slowest receiver, but are relatively simple. Multi-rate schemes allow of heterogeneous receive rates and thus provide better scalability, but rely heavily on frequent updates to group membership state in the routers. A recent work by Kwon and Byers, combined these two methods and provided a multi-rate scheme by means of single-rate schemes with relatively low complexity. In this paper, we propose a new scheme called generalized multicast congestion control (GMCC). GMCC provides multi-rate features at low complexity by using a set of independent single-rate sub-sessions (a.k.a layers) as building blocks. The scheme is named GMCC because single-rate MCC is just one of its special cases. Unlike the earlier work by Kwon and Byers, GMCC does not have the drawback of static configuration of the source which may not match with the dynamic network situations. GMCC is fully adaptive in that (i) it does not statically set a particular range for the sending rates of layers, and (ii) it eliminates redundant layers when they are not needed. Receivers can subscribe to different subsets of the available layers and hence can always obtain different throughput. While no redundant layers are used, GMCC allows receivers to activate a new layer in case existing layers do not accommodate the needs of the actual receivers. 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Editorial Manager(tm) for Computer Networks Title: Generalized Multicast Congestion Control Generalized Multicast Congestion Control ⋆
Generalized Multicast Congestion Control ⋆ Jiang Li b , Murat Yuksel a,∗ , Xingzhe Fan a and Shivkumar Kalyanaraman a Rensselaer Polytechnic Institute, Electrical Computer and Systems Engineering Department, 110 8th Street, Troy, NY 12180, USA. Howard University, Systems and Computer Science Department, 2300 6th Avenue, N.W. Washington, DC 20059, USA.
متن کاملAnalysis and Taxonomy of Congestion Control Mechanisms for Internet Reliable Multicast
The research of congestion control for Internet reliable multicast is one of the most active fields in reliable multicast protocol research. Many reliable multicast congestion control mechanisms have been put forward. In this paper we present principal problems of congestion control for Internet reliable multicast, analyze solutions and difficulties of solving these problems, and then give a cl...
متن کاملThe Multicast Dissemination Protocol (mdp) Toolkit
The Multicast Dissemination Protocol (MDP) provides reliable multicast file and data delivery on top of the generic UDP/IP multicast transport. Early work on MDP was deployed across the global Internet Multicast Backbone (Mbone) as part of the publicly available Image Multicaster (IMM) application. This paper describes more recent work on MDP resulting in the MDP version 2 (MDPv2) toolkit. This...
متن کاملCongestion Control Performance of a Reliable Multicast Protocol
This paper evaluates the congestion control performance of Pseudofed, a congestion-controlled, reliable multicast transport protocol for bulk data transfer. Pseudofed’s congestion control mechanism is based on the concept of representatives, a small, dynamic set of multicast group members. By reducing the congestion control problem to a bounded set of receivers, representatives allow the pointt...
متن کاملRouting-Based Video Multicast Congestion Control
Congestion control is critical for a multicast transport protocol to be deployed and coexist fairly with current unicast transport protocols, such as TCP. We present a new congestion control protocol for video multicast: Routingbased Video Multicast Congestion Control (RVMCC), which combats congestion from a new direction: enriching abstractions of the routing layer. RVMCC overcomes most of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 51 شماره
صفحات -
تاریخ انتشار 2007